翻訳と辞書 Words near each other ・ Seligman Baer ・ Self-Titled Long-Playing Debut Album ・ Self-titled/Homebrew ・ Self-transcendence ・ Self-Transcendence 12+24 Hour Race Basel ・ Self-Transcendence 24 Hour Race Ottawa ・ Self-Transcendence 3100 Mile Race ・ Self-Transcendence 6- & 10-day Race ・ Self-Transcendence Marathon ・ Self-transforming brain ・ Self-translation ・ Self-tuning ・ Self-uniting marriage ・ Self-validating reduction ・ Self-verification theory ・ Self-verifying theories ・ Self-voicing ・ Self-working magic ・ Self-XSS ・ Self/less ・ Selfafornia ・ Selfat ・ Selfati ・ Selfcaged ・ Selfhaters (album) ・ Selfhood ・ Selfie ・ Selfie (disambiguation) ・ Selfie (Mina album) ・ Selfie (song) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Self-verifying theories ： ウィキペディア英語版 Self-verifying theories Self-verifying theories are consistent first-order systems of arithmetic much weaker than Peano arithmetic that are capable of proving their own consistency. Dan Willard was the first to investigate their properties, and he has described a family of such systems. According to Gödel's incompleteness theorem, these systems cannot contain the theory of Peano arithmetic, and in fact, not even the weak fragment of Robinson arithmetic; nonetheless, they can contain strong theorems. In outline, the key to Willard's construction of his system is to formalise enough of the Gödel machinery to talk about provability internally without being able to formalise diagonalisation. Diagonalisation depends upon being able to prove that multiplication is a total function (and in the earlier versions of the result, addition also). Addition and multiplication are not function symbols of Willard's language; instead, subtraction and division are, with the addition and multiplication predicates being defined in terms of these. Here, one cannot prove the $\backslash Pi^0\_2$ sentence expressing totality of multiplication: :$(\backslash forall\; x,y)\backslash \; (\backslash exists\; z)\backslash \; (x,y,z).$ where $$ is the three-place predicate which stands for $z/y=x$. When the operations are expressed in this way, provability of a given sentence can be encoded as an arithmetic sentence describing termination of an analytic tableau. Provability of consistency can then simply be added as an axiom. The resulting system can be proven consistent by means of a relative consistency argument with respect to ordinary arithmetic. We can add any true $\backslash Pi^0\_1$ sentence of arithmetic to the theory and still remain consistent. ==References== *Solovay, R., 1989. "Injecting Inconsistencies into Models of PA". Annals of Pure and Applied Logic 44(1-2): 101—132. *Willard, D., 2001. "Self Verifying Axiom Systems, the Incompleteness Theorem and the Tangibility Reflection Principle". Journal of Symbolic Logic 66:536—596. *Willard, D., 2002. "How to Extend the Semantic Tableaux and Cut-Free Versions of the Second Incompleteness Theorem to Robinson's Arithmetic Q" . Journal of Symbolic Logic 67:465—496. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Self-verifying theories」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.